package priv.pront.code.lanqiao.competition.course.date0327;

import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

// TODO 剩下三种情况没写
public class AccordingToBartjens {
    static Set<String> set = new TreeSet<>();
    static int add = 0, sub = 0, mul = 0;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.nextLine();
        String word = s.substring(0, s.length() - 1);
//        只有 + 或者 - 的情况
        singleJiaJian(word);
//        + - 号共存的情况
        jiajianBoth(word);
//        只有 * 号的情况
        singleMul(word, 1, Integer.parseInt(word.substring(0, 1)));
//        只有+ * 号 的情况

//        只有 - * 号的情况


//        三者均有的情况
    }

    private static void singleMul(String word,int startIndex,int sum) {
        if(sum > 2000){
            return;
        }
        for (int i = startIndex; i < word.length() - 1; i++) {
            if (word.charAt(i) == '0') continue;
//            sum *

        }
    }

    private static void jiajianBoth(String word) {
        for (int i = 1; i < word.length() - 1; i++) {  // 加号的位置
            if (word.charAt(i) == '0') continue;
            for (int k = 1; k < word.length() - 1; k++) {  // 减号的位置
                if (i == k || word.charAt(i) == '0') continue;
                int num1 = Integer.parseInt(word.substring(0, i));
                int num2 = Integer.parseInt(word.substring(i, k));
                int num3 = Integer.parseInt(word.substring(k));
                if (num1 + num2 - num3 == 2000) {
                    set.add(word.substring(0, i) + "+" + word.substring(i, k) + "-" + word.substring(k));
                }
            }
        }

        for (int i = 1; i < word.length() - 1; i++) {  // 减号的位置
            if (word.charAt(i) == '0') continue;
            for (int k = 1; k < word.length() - 1; k++) {  // 加号的位置
                if (i == k || word.charAt(i) == '0') continue;
                int num1 = Integer.parseInt(word.substring(0, i));
                int num2 = Integer.parseInt(word.substring(i, k));
                int num3 = Integer.parseInt(word.substring(k));
                if (num1 - num2 + num3 == 2000) {
                    set.add(word.substring(0, i) + "-" + word.substring(i, k) + "+" + word.substring(k));
                }
            }
        }
    }

    private static void singleJiaJian(String word) {
        int sum = 0;
        int j = 100;
        for (int i = 1; i < 4; i++, j /= 10) {
            add += word.charAt(i) * j;
            sub += word.charAt(i) * j;
        }
        j = 100;
        for (int i = 4; i < word.length(); i++, j /= 10) {
            sum += word.charAt(i) * j;
        }
        if (sum + add == 1000 && word.charAt(0) == '1') {
            set.add(word.substring(0, 4) + "+" + word.substring(4));
        }
        if (sum == sub && word.charAt(0) == '2') {
            set.add(word.substring(0, 4) + "-" + word.substring(4));
        }
    }
}
